Vector-stability of multiple vector refinable vectors
نویسندگان
چکیده
منابع مشابه
Vector cascade algorithms and refinable function vectors in Sobolev spaces
In this paper we shall study vector cascade algorithms and refinable function vectors with a general isotropic dilation matrix in Sobolev spaces. By investigating several properties of the initial function vectors in a vector cascade algorithm, we are able to take a relatively unified approach to study several questions such as convergence, rate of convergence and error estimate for a perturbed...
متن کاملconstruction of vector fields with positive lyapunov exponents
in this thesis our aim is to construct vector field in r3 for which the corresponding one-dimensional maps have certain discontinuities. two kinds of vector fields are considered, the first the lorenz vector field, and the second originally introced here. the latter have chaotic behavior and motivate a class of one-parameter families of maps which have positive lyapunov exponents for an open in...
15 صفحه اولMultiple Description Lattice Vector Quantization Multiple Description Lattice Vector Quantization
This thesis studies the multiple description vector quantization with lattice codebooks (MDLVQ). The design of index assignment is crucial to the performance of MDLVQ. However, to our best knowledge, none of previous index assignment algorithms for MDLVQ is optimal. In this thesis, we propose a simple linear-time index assignment algorithm for MDLVQ with any K ≥ 2 balanced descriptions. We prov...
متن کاملGeneralized interpolating refinable function vectors
Interpolating scalar refinable functions with compact support are of interest in several applications such as sampling theory, signal processing, computer graphics, and numerical algorithms. In this paper, we shall generalize the notion of interpolating scalar refinable functions to compactly supported interpolating d-refinable function vectors with any multiplicity r and dilation factor d. Mor...
متن کاملIndex Vector Elimination - Making Index Vectors Affordable
Compiling indexing operations on n-dimensional arrays into efficiently executable code is a challenging task. This paper focuses on the reduction of offset computations as they typically occur when transforming index vectors into offsets for linearized representations of ndimensional arrays. We present a high-level optimization to that effect which is generally applicable, even in the presence ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Classical Analysis
سال: 2017
ISSN: 1848-5987
DOI: 10.7153/jca-10-15